Upper Bounds on Character Sums with Rational Function Entries
نویسندگان
چکیده
We obtain formulae and estimates for character sums of the type S(χ, f, pm) = ∑pm x=1 χ(f(x)), where p m is a prime power with m ≥ 2, χ is a multiplicative character (mod pm), and f = f1/f2 is a rational function over Z. In particular, if p is odd, d = deg(f1) + deg(f2) and d∗ = max(deg(f1), deg(f2)) then we obtain |S(χ, f, pm)| ≤ (d− 1)pm(1− 1 d∗ ) for any non constant f (mod p) and primitive character χ. For p = 2 an extra factor of 2 √ 2 is needed.
منابع مشابه
Multiplicative Character Sums with the Sum of g-ary Digits Function
We establish upper bounds for multiplicative character sums with the function σg(n) which computes the sum of the digits of n in a fixed base g ≥ 2. Our results may be viewed as analogues of some previously known results for exponential sums with sum of g-ary digits function. MSC Numbers: 11L40, 11A63.
متن کاملOn the Average Value of Divisor Sums in Arithmetic Progressions
We consider very short sums of the divisor function in arithmetic progressions prime to a fixed modulus and show that “on average” these sums are close to the expected value. We also give applications of our result to sums of the divisor function twisted with characters (both additive and multiplicative) taken on the values of various functions, such as rational and exponential functions; in pa...
متن کاملCharacter sums over norm groups
In this paper, we give estimates of character sums of Weil type. They are associated with polynomials and rational functions with coefficients in a quadratic extension k2 of a finite field k of q elements, additive and multiplicative characters of k2, and summed over the kernel of the norm map from k× 2 to k×. The bounds are of the magnitude O( √ q) with the implied constant depending on the de...
متن کاملCharacter sums and nonlinear recurrence sequences
We obtain upper bounds on character sums and autocorrelation of nonlinear recurrence sequences over arbitrary finite rings. © 2006 Elsevier B.V. All rights reserved.
متن کاملSharp Bounds for Sums Associated to Graphs of Matrices
We provide a simple algorithm for finding the optimal upper bound for sums of products of matrix entries of the form
متن کامل